منابع مشابه
Newton polygons and curve gonalities
We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number of special cases. One proof technique uses recent work of M. Baker on linear systems on graphs, by means of which we reduce our conjecture to a purely combin...
متن کاملDeterminantal singularities and Newton polyhedra
We introduce so called resultantal singularities (Definitions 5.1 and 8.1), whose study in terms of Newton polyhedra unifies the tasks A and B to a certain extent. In particular, this provides new formulations and proofs for a number of well known results (see, for example, Theorem 5.7 related to task A and Corollary 4.6 related to task B). As an application, we study basic topological invarian...
متن کاملMetrics with conic singularities and spherical polygons
A spherical n-gon is a bordered surface homeomorphic to a closed disk, with n distinguished boundary points called corners, equipped with a Riemannian metric of constant curvature 1, except at the corners, and such that the boundary arcs between the corners are geodesic. We discuss the problem of classification of these polygons and enumerate them in the case that two angles at the corners are ...
متن کاملNewton Polygons and Families of Polynomials
We consider a continuous family (fs), s ∈ [0, 1] of complex polynomials in two variables with isolated singularities, that are Newton non-degenerate. We suppose that the Euler characteristic of a generic fiber is constant. We firstly prove that the set of critical values at infinity depends continuously on s, and secondly that the degree of the fs is constant (up to an algebraic automorphism of...
متن کاملHigher Newton Polygons and Integral Bases
Let A be a Dedekind domain whose field of fractions K is a global field. Let p be a non-zero prime ideal of A, and Kp the completion of K at p. The Montes algorithm factorizes a monic irreducible separable polynomial f(x) ∈ A[x] over Kp, and it provides essential arithmetic information about the finite extensions of Kp determined by the different irreducible factors. In particular, it can be us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications of the Research Institute for Mathematical Sciences
سال: 1976
ISSN: 0034-5318
DOI: 10.2977/prims/1195196601